Combinatorial Methods in Complex Analysis
نویسنده
چکیده
The theme of this thesis is combinatorics, complex analysis and algebraic geometry. The thesis consists of six articles divided into four parts. Part A: Spectral properties of the Schrödinger equation This part consists of Papers I-II, where we study a univariate Schrödinger equation with a complex polynomial potential. We prove that the set of polynomial potentials that admits solutions to the Schrödinger equation satisfying certain boundary conditions, is connected. We also study a similar problem for even polynomial potentials, where a similar result is obtained. Part B: Graph monomials and sums of squares In this part, consisting of Paper III, we study natural bases for the space of homogeneous, symmetric and translation-invariant polynomials in terms of multigraphs. We find all multigraphs with at most six edges that give rise to non-negative polynomials, and determine which of these that can be expressed as a sum of squares. Part C: Eigenvalue asymptotics of banded Toeplitz matrices This part consists of Papers IV-V. We give a new and generalized proof of a theorem by P. Schmidt and F. Spitzer concerning asymptotics of eigenvalues of Toeplitz matrices. We also generalize the notion of eigenvalues to rectangular matrices, and partially prove the multivariate analogue of the above theorem. Part D: Stretched Schur polynomials This part consists of Paper VI, where we give a combinatorial proof of the fact that certain sequences of skew Schur polynomials satisfy linear recurrences with polynomial coefficients.
منابع مشابه
Invariance of the barycentric subdivision of a simplicial complex
In this paper we prove that a simplicial complex is determined uniquely up to isomorphism by its barycentric subdivision as well as its comparability graph. We also put together several algebraic, combinatorial and topological invariants of simplicial complexes.
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملA Structural Organization of Modern English Multiple Complex-Compound
The article focuses on the factors that cause linear and vertical sentence extension of multiple complex-compound sentences used in English fictional literature. Considering the sentence structure as a combination of 2 Units – paratactic and hypotactic the authors define the structural peculiarities of paratactic and hypotactic units including the number of clauses and its bonds. The extension ...
متن کاملTHIN WALLED STEEL SECTIONS’ FREE SHAPE OPTIMIZATION USING CHARGED SYSTEM SEARCH ALGORITHM
Graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. The combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. This paper presents a Charged System Search (CSS) algorithm for the free shape optimizations of thin-wall...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کامل